Algorithms to test open set condition for self-similar set related to P.V. numbers
نویسندگان
چکیده
منابع مشابه
Self-similar Sets with an Open Set Condition and Great Variety of Overlaps
For a very simple family of self-similar sets with two pieces, we prove, using a technique of Solomyak, that the intersection of the pieces can be a Cantor set with any dimension in [0, 0.2] as well as a finite set of any cardinality 2m. The main point is that the open set condition is fulfilled for all these examples.
متن کاملMatrices similar on a Zariski - open set
1. Introduction ,(1.1) Let A, B be n x n matrices whose elements are functions holomorphic in a connected open subset V of the complex plane. The matrices A, Bare called pointwise similar on V if for each XE V there exists a non-singular n x n matrix C x with complex elements such that B(x) = C;;l A (x) Cx' They are holomorphically similar on V if there exists a matrix C of functions holomorphi...
متن کاملCodes, Simplifying Words, and Open Set Condition
In formal language theory the concept of simplifying words is considered in connection with the deciphering delay of codes (cf. BP, Section II.8], LP]). In this paper we show that transferring a deenition from the theory of iterated function systems (IFS) sheds some new light on simplifying words.: Formal languages may be considered as IFS in the Cantor space of innnite strings over a nite alph...
متن کاملA Test Set for Molecular Dynamics Algorithms
This article describes a collection of model problems for aiding numerical analysts, code developers and others in the design of computational methods for molecular dynamics (MD) simulation. Common types of calculations and desirable features of algorithms are surveyed, and these are used to guide selection of representative models. By including essential features of certain classes of molecula...
متن کاملEfficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2015
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2014.07.032